Comparing Individual and Collaborative Problem Solving in Environmental Search

نویسندگان

  • Franziska Keilmann
  • Stephan de la Rosa
  • Stephan Schwan
  • Ulrike Cress
  • Betty J. Mohler
  • Heinrich H. Bülthoff
  • Tobias Meilinger
چکیده

Collaborative spatial problem solving is an important yet not thoroughly examined task. Participants navigated individually and in dyads through virtual cities of varying complexity. They only saw the environment part visible from their current location from a bird’s eye view map perspective. We recorded missed target locations, overall trajectory length and search time per person until self-indicating whole coverage. Our results show a general increase in missed locations, trajectory length, and search time with the complexity of the environment. These increases differed due to individual and collaborative search. For complex, but not for simple environments individual participants navigated shorter distances, finished earlier, but also missed more target locations than when searching the same environments in collaboration. These results indicate that in complex environments collaborative search is less error prone than individual search, but takes longer. Such initial findings will constrain future theorizing about collaborative spatial problem solving.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Robust Modeling Of Inventory Routing In Collaborative Reverse Supply Chains

This paper proposes a robust model for optimizing collaborative reverse supply chains. The primary idea is to develop a collaborative framework that can achieve the best solutions in the uncertain environment. Firstly, we model the exact problem in the form of a mixed integer nonlinear programming. To regard uncertainty, the robust optimization is employed that searches for an optimum answer wi...

متن کامل

A Hybrid Dynamic Programming for Inventory Routing Problem in Collaborative Reverse Supply Chains

Inventory routing problems arise as simultaneous decisions in inventory and routing optimization. In the present study, vendor managed inventory is proposed as a collaborative model for reverse supply chains and the optimization problem is modeled in terms of an inventory routing problem. The studied reverse supply chains include several return generators and recovery centers and one collection...

متن کامل

Solving multi-objective team orienteering problem with time windows using adjustment iterated local search

One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...

متن کامل

Intelligent Tuned Harmony Search for Solving Economic Dispatch Problem with Valve-point Effects and Prohibited Operating Zones

Economic dispatch with valve point effect and Prohibited Operating Zones (POZs) is a non-convex and discontinuous optimization problem. Harmony Search (HS) is one of the recently presented meta-heuristic algorithms for solving optimization problems, which has different variants. The performances of these variants are severely affected by selection of different parameters of the algorithm. Intel...

متن کامل

APPLICATION OF TABU SEARCH FOR SOLVING THE BI-OBJECTIVE WAREHOUSE PROBLEM IN A FUZZY ENVIRONMENT

The bi-objective warehouse problem in a crisp environment is often not eective in dealing with the imprecision or vagueness in the values of the problem parameters. To deal with such situations, several researchers have proposed that the parameters be represented as fuzzy numbers. We describe a new algorithm for fuzzy bi-objective warehouse problem using a ranking function followed by an applic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017